Generalized covering designs and clique coverings
نویسندگان
چکیده
منابع مشابه
Generalized covering designs and clique coverings
Inspired by the “generalized t-designs” defined by Cameron [P. J. Cameron, A generalisation of t-designs, Discrete Math. 309 (2009), 4835–4842], we define a new class of combinatorial designs which simultaneously provide a generalization of both covering designs and covering arrays. We then obtain a number of bounds on the minimum sizes of these designs, and describe some methods of constructin...
متن کاملGeneralized clique coverings of chordal graphs
Two main types 1)£ clique coveri cd phs ha'J(? d j,scussed. One is ali que c C) v p r i r, 9 Cl f \! l-''', ice S , a set ,-, f clIques which between them contain eve! 'JI? te:,c at once. The other, a clique c:-overing of edgEs, is a set f cliques which between them contain eVPIY e0ge. CllVering of edges may be deflned as a lique covering of vertices with the added rest iction hat tho=> I:'"nds...
متن کاملClique partitions and clique coverings
Several new tools are presented for determining the number of cliques needed to (edge-)partition a graph . For a graph on n vertices, the clique partition number can grow cn z times as fast as the clique covering number, where c is at least 1/64. If in a clique on n vertices, the edges between en° vertices are deleted, Z--a < 1, then the number of cliques needed to partition what is left is asy...
متن کاملClique coverings and partitions of line graphs
A clique in a graph G is a complete subgraph of G. A clique covering (partition) of G is a collection C of cliques such that each edge of G occurs in at least (exactly) one clique in C. The clique covering (partition) number cc(G) (cp(G)) of G is the minimum size of a clique covering (partition) of G. This paper gives alternative proofs, using a unified approach, for the results on the clique c...
متن کاملOn Asymmetric Coverings and Covering Numbers
An asymmetric covering D(n,R) is a collection of special subsets S of an n-set such that every subset T of the n-set is contained in at least one special S with |S| − |T | ≤ R. In this paper we compute the smallest size of any D(n, 1) for n ≤ 8. We also investigate “continuous” and “banded” versions of the problem. The latter involves the classical covering numbers C(n, k, k−1), and we determin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Designs
سال: 2011
ISSN: 1063-8539
DOI: 10.1002/jcd.20288